Balanced-by-Construction Regular and ω-Regular Languages

نویسندگان

چکیده

Paren n is the typical generalization of Dyck language to multiple types parentheses. We generalize its notion balancedness allow parentheses different freely commute. show that balanced regular and [Formula: see text]-regular languages can be characterized by syntactic constraints on expressions and, using shuffle trajectories operator, we define grammars for balanced-by-construction with which one express every language.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages

In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...

متن کامل

Undecidability in ω-Regular Languages

In the infinite Post Correspondence Problem an instance (h, g) consists of two morphisms h and g, and the problem is to determine whether or not there exists an infinite word α such that h(α) = g(α). In the general case this problem was shown to be undecidable by K. Ruohonen (1985). Recently, it was proved that the infinite PCP is undecidable already when the domain alphabet of the morphisms co...

متن کامل

Languages vs . ω - Languages in Regular Infinite

Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes K of regular languages of finite words (called ∗-languages), using natural transformations of ∗-langua...

متن کامل

Fine Hierarchy of Regular ω-Languages

By applying descriptive set theory to the Wagner’s fine structure of regular ω-languages we get quite different proofs of his results and obtain new results. We give an automata-free description of the fine structure. We present also a simple property of a deterministic Muller automaton equivalent to the condition that the corresponding regular ω-language belongs to any given level of the fine ...

متن کامل

Recognizing ω-regular Languages with Probabilistic Automata

Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for ω-regular languages. Our main results are that our variant of probabilistic Büchi automata (PBA) is more expressive than non-deterministic ω-automata, but a certain subclass of PBA, called uniform PBA, has ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Foundations of Computer Science

سال: 2022

ISSN: ['1793-6373', '0129-0541']

DOI: https://doi.org/10.1142/s0129054122440026